Decoding From Pooled Data: Phase Transitions of Message Passing
نویسندگان
چکیده
منابع مشابه
Universality in Polytope Phase Transitions and Message Passing Algorithms
We consider a class of nonlinear mappings FA,N in R N indexed by symmetric random matrices A ∈ R with independent entries. Within spin glass theory, special cases of these mappings correspond to iterating the TAP equations and were studied by Erwin Bolthausen. Within information theory, they are known as ‘approximate message passing’ algorithms. We study the high-dimensional (large N) behavior ...
متن کاملComputational Complexity, Phase Transitions, and Message-Passing for Community Detection
These are notes from the lecture of Cristopher Moore given at the autumn school “Statistical Physics, Optimization, Inference, and Message-Passing Algorithms”, that took place in Les Houches, France from Monday September 30th, 2013, till Friday October 11th, 2013. The school was organized by Florent Krzakala from UPMC & ENS Paris, Federico Ricci-Tersenghi from La Sapienza Roma, Lenka Zdeborová ...
متن کاملPhase Transitions in the Pooled Data Problem
In this paper, we study the pooled data problem of identifying the labels associated with a large collection of items, based on a sequence of pooled tests revealing the counts of each label within the pool. In the noiseless setting, we identify an exact asymptotic threshold on the required number of tests with optimal decoding, and prove a phase transition between complete success and complete ...
متن کاملMessage Passing Algorithm for Iterative Decoding of Channel Codes
Packet data broadcast systems require error free delivery of packet data without retransmission requests. Turbo codes can be used to achieve very low packet error rates. To achieve this low error rate with a very small gap from the system capacity, several design considerations need to be made. We need to use higher constraintlength codes (increasing complexity exponentially) with larger block ...
متن کاملConvergence Analysis of Serial Message-Passing Schedules for LDPC Decoding
Serial decoding schedules for low-density parity-check (LDPC) codes are described and analyzed. Conventionally, in each iteration all the variable nodes and subsequently all the check nodes send messages to their neighbors (“flooding schedule”). In contrast, in the considered methods, the updating of the nodes is implemented according to a serial schedule. The evolution of the decoding algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2855698